Automated search for Gödel’s proofs

Automated search for Gödel's proofs

Flexible Interface for Automated Proofs

The aartifact system [1] is an automated assistant for formal reasoning. It is currently architected using a client-server model. In order to better support in-class use, and enable greater scalability a JavaScript implementation of key functional areas of the sytem is desired. The automated proof landscape has to date concentrated little effort towards creating suitably usable interfaces. Towa...

Completely Automated Equivalence Proofs

Verifying partial (i.e., termination-insensitive) equivalence of programs has significant practical applications in software development and education. Conventional equivalence verifiers typically rely on a combination of given relational summaries and suggested synchronization points; such information can be extremely difficult for programmers without a background in formal methods to provide ...

Automated Compositional Proofs for Real-Time Systems

We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, real-time system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/guarantee circular inference rule, plus a small set of conditions concerning the integration of the different parts into a whole system. The refe...

Automated Proofs for Some Stirling Number Identities

We present computer-generated proofs of some summation identities for (q-)Stirling and (q-)Eulerian numbers that were obtained by combining a recent summation algorithm for Stirling number identities with a recurrence solver for difference fields.